Numerical Calculation of a Minimal Surface Using Bilinear Interpolations and Chebyshev Polynomials
نویسندگان
چکیده
We calculate the minimal surface bounded by four-sided figures whose projection on a plane is a rectangle, starting with the bilinear interpolation and using, for smoothness, the Chebyshev polynomial expansion in our discretized numerical algorithm to get closer to satisfying the zero mean curvature condition. We report values for both the bilinear and improved areas, suggesting a quantitative evaluation of the bilinear interpolation. An analytical expression of the Schwarz minimal surface with polygonal boundaries and its 3-dimensional plot is also given.
منابع مشابه
Optimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials
In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملThe operational matrix of fractional derivative of the fractional-order Chebyshev functions and its applications
In this paper, we introduce a family of fractional-order Chebyshev functions based on the classical Chebyshev polynomials. We calculate and derive the operational matrix of derivative of fractional order $gamma$ in the Caputo sense using the fractional-order Chebyshev functions. This matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...
متن کاملUsing Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions
Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...
متن کاملApplication of Chebyshev Polynomials for Solving Abel's Integral Equations of the First and Second Kind
In this paper, a numerical implementation of an expansion method is developed for solving Abel's integral equations of the first and second kind. The solution of such equations may demonstrate a singular behaviour in the neighbourhood of the initial point of the interval ofintegration. The suggested method is based on the use of Taylor series expansion to overcome the singularity which le...
متن کامل